Optimization of No-Wait Flowshop Scheduling Problem in Bakery Production with Modified PSO, NEH and SA
نویسندگان
چکیده
In bakery production, to perform a processing task there might be multiple alternative machines that have the same functionalities. Finding an efficient production schedule is challenging due significant nondeterministic polynomial time (NP)-hardness of problem when number products, tasks, and are higher. addition, many tasks performed manually as small medium-size bakeries not fully automated. Therefore, along with machines, integration employees in planning essential. This paper presents hybrid no-wait flowshop scheduling model (NWFSSM) comprising constraints common practice bakeries. The existing line simulated examine optimized by performing particle swarm optimization (PSO), modified (MPSO), annealing (SA), Nawaz-Enscore-Ham (NEH) algorithms. computational results reveal performance PSO significantly influenced weight distribution exploration exploitation run time. Due modification acceleration parameter, MPSO outperforms PSO, SA, NEH respect effectively finding schedule. best solution real case obtained shows reduction total idle (TIDT) 12% makespan 30%. result indicates for small- medium-sized industries, application NWFSSM nature-inspired algorithms can powerful tool make system efficient.
منابع مشابه
No-wait flexible flowshop scheduling with no-idle machines
This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds. © 2004 Elsevier B.V. All rights reserved.
متن کاملA Particle Swarm Optimization Approach for the Earliness-Tardiness No-Wait Flowshop Scheduling Problem
In this researcha particle swarm optimization (PSO) algorithm is proposedfor no-wait flowshopsequence dependent setuptime scheduling problem with weighted earliness-tardiness penalties as the criterion ( | , | ∑ " ).The smallestposition value (SPV) rule is applied to convert the continuous value of position vector of particles in PSO to job permutations.A timing algorithm is generated to find t...
متن کاملSolving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملSolving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Processes
سال: 2021
ISSN: ['2227-9717']
DOI: https://doi.org/10.3390/pr9112044